Relational lattices: From databases to universal algebra
نویسندگان
چکیده
منابع مشابه
Relational lattices: From databases to universal algebra
Relational lattices are obtained by interpreting lattice connectives as natural join and inner union between database relations. Our study of their equational theory reveals that the variety generated by relational lattices has not been discussed in the existing literature. Furthermore, we show that addition of just the header constant to the lattice signature leads to undecidability of the qua...
متن کاملA Relational Algebra for Negative Databases
A negative database is a representation of all elements not contained in a given database. A negative database can enhance the privacy of sensitive information without resorting to encryption. This can be useful in settings where encryption is too expensive, e.g., some sensor networks, or for applications where searches or other operations on stored data are desired. The original negative datab...
متن کاملSideway Value Algebra for Object-Relational Databases
Using functions in various forms, recent database publications have assigned “scores”, “preference values”, and “probabilistic values” to object-relational database tuples. We generalize these functions and their evaluations as sideway functions and sideway values, respectively. Sideway values represent the advices (recommendations) of data creators or preferences of users, and are employed for...
متن کاملFrom Ontology to Relational Databases
The semantic web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. Ontologies, a cornerstone of the semantic web, have gained wide popularity as a model of information in a given domain that can be used for many purposes, including enterprise integration, database design, information retrieval and information interchange on the ...
متن کاملFrom relational to deductive databases
This paper highlights the limits of current implementations of SQL and shows how they can be overcome with deductive approaches. Deductive query languages subsuming relational ones must include constructors to allow users for submitting queries semantically equivalent to their relational counterparts. As deductive languages are based on first order predicate logic, they are able to capture rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2016
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2015.11.008